public class pr {
    public static void main(String[] args) {
        int[][]map=new int[8][7];
        for (int j = 0; j < 7; j++) {
            map[0][j]=1;
            map[7][j]=1;
        }
        for (int i = 0; i < 8; i++) {
            map[i][0]=1;
            map[i][6]=1;
        }
        map[3][1]=1;
        map[3][2]=1;
        System.out.println("******地图如下*******");
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j < 7; j++) {
                System.out.print(map[i][j]+"  ");
            }
            System.out.println();
        }
        T t=new T();
        t.finway(map,1,1);
        if(map[6][5]!=2){
            System.out.println("无通路");
        }
        //调用方法
        System.out.println("******地图如下*******");//再打印走好的地图
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j < 7; j++) {
                System.out.print(map[i][j]+"  ");
            }
            System.out.println();
        }
    }
}
class T{
    public boolean finway(int[][]map,int i,int j){
        if(map[6][5]==2){
            return true;
        }
        else{
            if(map[i][j]==0){
                map[i][j]=2;
                if(finway(map, i+1, j)){
                    return true;
                }
                else if (finway(map, i, j+1)){
                    return true;
                }
                else if(finway(map, i-1, j)){
                    return true;
                }
                else if(finway(map, i, j-1)){
                    return true;
                }
                else {
                    map[i][j]=3;
                    return false;
                }
            }else {
                return false;
            }
        }
    }
}
